The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
نویسندگان
چکیده
منابع مشابه
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
Let C (3) n denote the 3-uniform tight cycle, that is the hypergraph with vertices v1, . . . , vn and edges v1v2v3, v2v3v4, . . . , vn−1vnv1, vnv1v2. We prove that the smallest integer N = N(n) for which every red-blue coloring of the edges of the complete 3-uniform hypergraph with N vertices contains a monochromatic copy of C (3) n is asymptotically equal to 4n/3 if n is divisible by 3, and 2n...
متن کاملThe Ramsey Number for Hypergraph Cycles Ii
Let C (3) n denote the 3-uniform tight cycle, that is the hypergraph with vertices v1, . . . , vn and edges v1v2v3, v2v3v4, . . . , vn−1vnv1, vnv1v2. We prove that the smallest integer N = N(n) for which every red-blue coloring of the edges of the complete 3-uniform hypergraph with N vertices contains a monochromatic copy of C (3) n is asymptotically equal to 4n/3 if n is divisible by 3, and 2n...
متن کاملHypergraph Ramsey numbers: tight cycles versus cliques
For s ≥ 4, the 3-uniform tight cycle C s has vertex set corresponding to s distinct points on a circle and edge set given by the s cyclic intervals of three consecutive points. For fixed s ≥ 4 and s 6≡ 0 (mod 3) we prove that there are positive constants a and b with 2 < r(C s ,K 3 t ) < 2 bt log . The lower bound is obtained via a probabilistic construction. The upper bound for s > 5 is proved...
متن کاملThe Ramsey Number for Hypergraph
Let Cn denote the 3-uniform hypergraph loose cycle, that is the hypergraph with vertices v1, . . . , vn and edges v1v2v3, v3v4v5, v5v6v7, . . . , vn−1vnv1. We prove that every red-blue colouring of the edges of the complete 3-uniform hypergraph with N vertices contains a monochromatic copy of Cn, where N is asymptotically equal to 5n/4. Moreover this result is (asymptotically) best possible.
متن کاملRestricted size Ramsey number for P 3 versus cycles
Let F , G and H be simple graphs. We say F → (G,H) if for every 2-coloring of the edges of F there exists a monochromatic G orH in F . The Ramsey number r(G,H) is defined as r(G,H) = min{|V (F )| : F → (G,H)}, while the restricted size Ramsey number r(G,H) is defined as r(G,H) = min{|E(F )| : F → (G,H), |V (F )| = r(G,H)}. In this paper we determine previously unknown restricted size Ramsey num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2009
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s096354830800967x